Parallel Algorithms for Network Routing Problems and Recurrences

Algorithms for network design and routing problems

Many practical problems arising in real world applications, mainly in the fields of logistics and telecommunications, can be modeled as network design or vehicle routing problems. In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transpo...

Parallel algorithms for vehicle routing problems

In a complete directed weighted graph there are jobs located at nodes of the graph. Job i has an associated processing time or handling time hi, and the job must start within a prespecified time window [ri; di]. A vehicle can move on the arcs of the graph, at unit speed, and that has to execute the jobs within their respective time windows. We consider three different problems on the CREW PRAM....

Parallel and Serial Algorithms for Vehicle Routing Problems

Title of dissertation: PARALLEL AND SERIAL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS Christopher Groër, Doctor of Philosophy, 2008 Dissertation directed by: Professor Bruce Golden Robert H. Smith School of Business The vehicle routing problem (VRP) is a widely studied combinatorial optimization problem that has many applications. Due to its intrinsic difficulty and the size of problems encountere...

Neural network parallel computing for multi-layer channel routing problems

Multi-layer channel routing is one of cumbersome jobs in automatic layout design of VLSI chips and PCBs. As VLSI chips have been used in every field of electrical engineering, it becomes more important to reduce the layout design time. With the advancement of the VLSI technology, four-layer problems can be treated and the algorithms for more than four-layer problems will be demanded in the near...

Formulations and Algorithms for Routing Problems